Improving Image Vector Quantization with a Genetic Accelerated K-Means Algorithm
نویسندگان
چکیده
In this paper, vector quantizer optimization is accomplished by a hybrid evolutionary method, which consists of a modified genetic algorithm (GA) with a local optimization module given by an accelerated version of the K-means algorithm. Simulation results regarding image compression based on VQ show that the codebooks optimized by the proposed method lead to reconstructed images with higher peak signalto-noise ratio (PSNR) values and that the proposed method requires fewer GA generations (up to 40%) to achieve the best PSNR results produced by the conventional GA + standard K-means approach. The effect of increasing the number of iterations performed by the local optimization module within the proposed method is discussed.
منابع مشابه
Terrain-Based Memetic Algorithms for Vector Quantizer Design
Recently, a Genetic Accelerated K-Means Algorithm (GAKM) was proposed as an approach for optimizing Vector Quantization (VQ) codebooks, relying on an accelerated version of K-Means algorithm as a new local learning module. This approach requires the determination of a scale factor parameter (η), which affects the local search performed by GAKM. The problem of auto-adapting the local search in G...
متن کاملGenetic Algorithms for Large-Scale Clustering Problems
We consider the clustering problem in a case where the distances of elements are metric and both the number of attributes and the number of the clusters are large. Genetic algorithm approach gives in this environment high quality clusterings at the cost of long running time. Three new efficient crossover techniques are introduced. The hybridization of genetic algorithm and k-means algorithm is ...
متن کاملAccelerating Families of Fuzzy K-Means Algorithms for Vector Quantization Codebook Design
The performance of signal processing systems based on vector quantization depends on codebook design. In the image compression scenario, the quality of the reconstructed images depends on the codebooks used. In this paper, alternatives are proposed for accelerating families of fuzzy K-means algorithms for codebook design. The acceleration is obtained by reducing the number of iterations of the ...
متن کاملData Clustring Using A New CGA(Chaotic-Generic Algorithm) Approach
Clustering is the process of dividing a set of input data into a number of subgroups. The members of each subgroup are similar to each other but different from members of other subgroups. The genetic algorithm has enjoyed many applications in clustering data. One of these applications is the clustering of images. The problem with the earlier methods used in clustering images was in selecting in...
متن کاملNGTSOM: A Novel Data Clustering Algorithm Based on Game Theoretic and Self- Organizing Map
Identifying clusters is an important aspect of data analysis. This paper proposes a noveldata clustering algorithm to increase the clustering accuracy. A novel game theoretic self-organizingmap (NGTSOM ) and neural gas (NG) are used in combination with Competitive Hebbian Learning(CHL) to improve the quality of the map and provide a better vector quantization (VQ) for clusteringdata. Different ...
متن کامل